MPool: Motif-Based Graph Pooling
نویسندگان
چکیده
Recently, Graph Neural Networks (GNNs) have emerged as a powerful technique for various graph-related tasks. Current GNN models apply different graph pooling methods that reduce the number of nodes and edges to learn higher-order structure in hierarchical way. However, these primarily rely on one-hop neighborhood do not consider graph. To address this issue, work, we propose multi-channel Motif-based Pooling method named (MPool) captures with motif also considers local global through combination selection clustering-based operations. In first channel, develop node selection-based by designing ranking model considering adjacency nodes. second cluster-based spectral clustering using adjacency. Finally, result each channel is aggregated into final representation. We perform extensive experiments demonstrate our proposed outperforms baseline classification tasks eight benchmark datasets.
منابع مشابه
MotifNet: a motif-based Graph Convolutional Network for directed graphs
Deep learning on graphs and in particular, graph convolutional neural networks, have recently attracted significant attention in the machine learning community. Many of such techniques explore the analogy between the graph Laplacian eigenvectors and the classical Fourier basis, allowing to formulate the convolution as a multiplication in the spectral domain. One of the key drawback of spectral ...
متن کاملScalable Motif-aware Graph Clustering
We develop new methods based on graph motifs for graph clustering, allowing more efficient detection of communities within networks. We focus on triangles within graphs, but our techniques extend to other clique motifs as well. Our intuition, which has been suggested but not formalized similarly in previous works, is that triangles are a better signature of community than edges. We therefore ge...
متن کاملProbabilistic opinion pooling generalized Part two: Premise-based opinion pooling
We consider the classical problem of aggregating di¤erent individualsprobability assignments (opinions) over a -algebra of events. In practice, some events represent basic propositions, such as it rainsor CO2 emissions cause global warming, while others represent combinations thereof, for instance disjunctions (unions) of basic events. It is plausible to treat the basic events as premises ...
متن کاملGraph Motif Problems Parameterized by Dual
Let G = (V,E) be a vertex-colored graph, where C is the set of colors used to color V . The Graph Motif (or GM) problem takes as input G, a multisetM of colors built from C, and asks whether there is a subset S ⊆ V such that (i) G[S] is connected and (ii) the multiset of colors obtained from S equals M . The Colorful Graph Motif (or CGM) problem is the special case of GM in which M is a set, an...
متن کاملGraph Convolutional Networks with Argument-Aware Pooling for Event Detection
The current neural network models for event detection have only considered the sequential representation of sentences. Syntactic representations have not been explored in this area although they provide an effective mechanism to directly link words to their informative context for event detection in the sentences. In this work, we investigate a convolutional neural network based on dependency t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2023
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-33377-4_9